An upper bound on the loss from approximate optimal-value functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An upper bound to the second Hankel functional for the class of gamma-starlike functions

‎The objective of this paper is to obtain an upper bound to the second Hankel determinant $|a_{2}a_{4}-a_{3}^{2}|$‎ ‎for the function $f$‎, ‎belonging to the class of Gamma-starlike functions‎, ‎using Toeplitz determinants‎. ‎The result presented here include‎ ‎two known results as their special cases‎.  

متن کامل

An Upper Bound on the First Zagreb Index in Trees

In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.

متن کامل

an upper bound to the second hankel functional for the class of gamma-starlike functions

‎the objective of this paper is to obtain an upper bound to the second hankel determinant $|a_{2}a_{4}-a_{3}^{2}|$‎ ‎for the function $f$‎, ‎belonging to the class of gamma-starlike functions‎, ‎using toeplitz determinants‎. ‎the result presented here include‎ ‎two known results as their special cases‎.

متن کامل

On trees attaining an upper bound on the total domination number

‎A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$‎. ‎The total domination number of a graph $G$‎, ‎denoted by $gamma_t(G)$‎, ‎is~the minimum cardinality of a total dominating set of $G$‎. ‎Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004)‎, ‎6...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Machine Learning

سال: 1994

ISSN: 0885-6125,1573-0565

DOI: 10.1007/bf00993308